NN-EVCLUS: Neural network-based evidential clustering
نویسندگان
چکیده
Evidential clustering is an approach to based on the use of Dempster-Shafer mass functions represent cluster-membership uncertainty. In this paper, we introduce a neural-network evidential algorithm, called NN-EVCLUS, which learns mapping from attribute vectors functions, in such way that more similar inputs are mapped output with lower degree conflict. The neural network can be paired one-class support vector machine make it robust outliers and allow for novelty detection. trained minimize discrepancy between dissimilarities degrees conflict all or some object pairs. Additional terms added loss function account pairwise constraints labeled data, also used adapt metric. Comparative experiments show superiority N-EVCLUS over state-of-the-art algorithms range unsupervised constrained tasks involving both dissimilarity data.
منابع مشابه
Evidential k-NN for Link Prediction
Social networks play a major role in today’s society, they have shaped the unfolding of social relationships. To analyze networks dynamics, link prediction i.e., predicting potential new links between actors, is concerned with inspecting networks topology evolution over time. A key issue to be addressed is the imperfection of real world social network data which are usually missing, noisy, or p...
متن کاملNeural network-based clustering for agriculture management
Remote sensing images have been used productively for land cover identification to accurately manage and control agricultural and environmental resources. However, these images have often been interpreted interactively due to the lack of effective automated methods. We propose such a method using self-organizing maps (SOM) based spectral clustering, for agriculture management. By combining the ...
متن کاملNeural network-based clustering using pairwise constraints
In this work, we address the problem of finding a clustering of high-dimensional data using only pairwise constraints provided as input. Our strategy utilizes the back-propagation algorithm for optimizing neural networks to discover the clusters, while at the same time the features are also learned during the same training process. In order to do this, we design a novel architecture that can in...
متن کاملRECM: Relational evidential c-means algorithm
A new clustering algorithm for proximity data, called RECM (Relational evidential c-means) is presented. This algorithm generates a credal partition, a new clustering structure based on the theory of belief functions, which extends the existing concepts of hard, fuzzy and possibilistic partitions. Two algorithms, EVCLUS (Evidential Clustering) and ECM (Evidential c-Means) were previously availa...
متن کاملEvidential Clustering: A Review
In evidential clustering, uncertainty about the assignment of objects to clusters is represented by Dempster-Shafer mass functions. The resulting clustering structure, called a credal partition, is shown to be more general than hard, fuzzy, possibilistic and rough partitions, which are recovered as special cases. Three algorithms to generate a credal partition are reviewed. Each of these algori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Sciences
سال: 2021
ISSN: ['0020-0255', '1872-6291']
DOI: https://doi.org/10.1016/j.ins.2021.05.011